Improving assembly precedence constraint generation by utilizing motion planning and part interaction clusters

نویسندگان

  • Carlos Morato
  • Krishnanand N. Kaipa
  • Satyandra K. Gupta
چکیده

In this paper, we present a technique that combines motion planning and part interaction clusters to improve generation of assembly precedence constraints. In particular, this technique automatically finds, and clusters, parts that can mutually affect each other’s accessibility, and hence may impose assembly constraints. This enables generation of accurate precedence constraints without needing to examine all possible assembly sequences. Given an assembly model, our technique generates potential disassembly layers: Spatial clustering is used to generate part sets. Next, motion planning based on rapidly-exploring random trees (RRT) with multiple trees is used to evaluate the interaction between these part sets. Specifically, motion planning is used to determine which part sets can be removed from the assembly. These sets are added to the first disassembly layer and removed from the assembly. Part sets that can be removed from the simplified assembly are then added to the second layer. If the process gets stuck, parts in the parent set are regrouped, and the process continues until all disassembly layers are found. The resulting structure reveals precedence relationships among part sets, which can be used to generate feasible assembly sequences for each part set and the whole assembly. We present theoretical results related to the algorithms developed in the paper. Computational results from tests on a Corresponding author Principal corresponding author Email addresses: [email protected] (Carlos Morato), [email protected] (Krishnanand Kaipa), [email protected] (Satyandra K. Gupta) Preprint submitted to Computer-Aided Design November 17, 2013 variety of assemblies are presented to illustrate our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph-Theoretic Generation of Assembly Plans Part II: Problem Decomposition and Optimization Algorithms

Efficient generation of assembly plans has significant implications on manufacturing costs, however, the underlying mathematical problem is both theoretically and computationally intractable. In the previous paper (Part I), we developed a graph-theoretic framework for the general problem, and we described a constraint satisfaction construct that generates correct assembly precedence graphs give...

متن کامل

Trajectory Planning Using High Order Polynomials under Acceleration Constraint

The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Assembly process modeling for virtual assembly process planning

Virtual assembly process planning (VAPP) provides a more efficient, intuitive and convenient method for assembly process planning. Previous efforts in this field are concentrated on how to assemble components together and how to analyze this assembly process in a virtual environment. However, how the interactive planning process can be modeled and organized, which is important for VAPP because ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer-Aided Design

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2013